#include <bits/stdc++.h>

using namespace std;

typedef double db;

const db eps = 1e-7;

int n,id[60];
db a[60][60];

int main (){
	scanf("%d",&n);for(int i = 1;i <= n;i++) for(int j = 1;j <= n+1;j++) scanf("%lf",&a[i][j]);
	int mainfac = 1;
	for(int i = 1;i <= n;i++){
		int j = mainfac,bigg = j;
		for(j = j+1;j <= n;j++) if(fabs(a[j][i]) > fabs(a[bigg][i])) bigg = j;
		if(fabs(a[bigg][i]) < eps) continue;
		for(int k = i;k <= n+1;k++) swap(a[bigg][k],a[mainfac][k]);
		for(j = 1;j <= n;j++){
			if(j == mainfac) continue;
			db t = a[j][i] / a[mainfac][i];
			for(int k = i;k <= n+1;k++) a[j][k] -= a[mainfac][k] * t;
		}
		id[i] = mainfac; mainfac++;
	}
	vector<int> p; for(int i = 1;i <= n;i++) if(!id[i]) p.push_back(i);
	for(int i = 0;i < p.size();i++,mainfac++) id[p[i]] = mainfac;
	for(int i = 1;i <= n;i++) if(fabs(a[id[i]][i]) < eps && fabs(a[id[i]][n+1]) > eps) {puts("-1");return 0;}
	for(int i = 1;i <= n;i++) if(fabs(a[id[i]][i]) < eps && fabs(a[id[i]][n+1]) < eps) {puts("0");return 0;}
	for(int i = 1;i <= n;i++) printf("x%d=%.2lf\n",i,a[id[i]][n+1]/a[id[i]][i]);
	return 0;
}
